A new geometric approach to Sturmian words
نویسندگان
چکیده
We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n× n-grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the well-known result that a factor of a Sturmian word has precisely two return words.
منابع مشابه
Complete Characterization of Substitution Invariant Sturmian Sequences
We provide a complete characterization of substitution invariant inhomogeneous bidirectional pointed Sturmian sequences. The result is analogous to that obtained by Berthé et al. [5] and Yasutomi [21] for one-directional Sturmian words. The proof is constructive, based on the geometric representation of Sturmian words by a cut-and-project scheme.
متن کاملOn substitution invariant Sturmian words: an application of Rauzy fractals
Sturmian words are infinite words that have exactly n+ 1 factors of length n for every positive integer n. A Sturmian word sα,ρ is also defined as a coding over a two-letter alphabet of the orbit of point ρ under the action of the irrational rotation Rα : x 7→ x+ α (mod 1). A substitution fixes a Sturmian word if and only if it is invertible. The main object of the present paper is to investiga...
متن کاملLanguage structure of pattern Sturmian words
Pattern Sturmian words introduced by Kamae and Zamboni KZ KZ are an analogy of Sturmian words for the maximal pattern com plexity instead of the block complexity So far two kinds of recur rent pattern Sturmian words are known namely rotation words and Toeplitz words But neither a structural characterization nor a reason able classi cation of the recurrent pattern Sturmian words is known In this...
متن کاملCharacterization of Repetitions in Sturmian Words: A New Proof
We present a new, dynamical way to study powers (or repetitions) in Sturmian words based on results from Diophantine approximation theory. As a result, we provide an alternative and shorter proof of a result by Damanik and Lenz characterizing powers in Sturmian words [Powers in Sturmian Sequences, European J. Combin. 24 (2003), 377–390]. Further, as a consequence, we obtain a previously known f...
متن کاملSome characterizations of finite Sturmian words
In this paper we give some new characterizations of words which are finite factors of Sturmian words. An enumeration formula for primitive finite Sturmian words is given. Moreover, we provide two linear-time algorithms to recognize whether a finite word is Sturmian.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 432 شماره
صفحات -
تاریخ انتشار 2012